SIESTA: enhancing searches for optimal supertrees and species trees
نویسندگان
چکیده
منابع مشابه
Optimal Agreement Supertrees
An agreement supertree of a collection of unrooted phylogenetic trees {T1, T2, . . . , Tk} with leaf sets L(T1), L(T2), . . . ,L(Tk) is an unrooted tree T with leaf set L(T1) ∪ · · · ∪ L(Tk) such that each tree Ti is an induced subtree of T . In some cases, there may be no possible agreement supertrees of a set of trees, in other cases there may be exponentially many. We present polynomial time...
متن کاملMinimal Phylogenetic Supertrees and Local Consensus Trees
The problem of constructing a minimally resolved phylogenetic supertree (i.e., having the smallest possible number of internal nodes) that contains all of the rooted triplets from a consistent set R is known to be NP-hard. In this paper, we prove that constructing a phylogenetic tree consistent with R that contains the minimum number of additional rooted triplets is also NP-hard, and develop ex...
متن کاملLarge Trees, Supertrees and the Grass Phylogeny
................................................................................................................xii Chapter
متن کاملTrees from trees: construction of phylogenetic supertrees using clann.
Supertree methods combine multiple phylogenetic trees to produce the overall best "supertree." They can be used to combine phylogenetic information from datasets only partially overlapping and from disparate sources (like molecular and morphological data), or to break down problems thought to be computationally intractable. Some of the longest standing phylogenetic conundrums are now being brou...
متن کاملOptimal Searches for Asteroids
Optimal searches for a fixed object are discussed and the rigorous analytical results of discrete search theory are presented. They show that the totally optimal, the uniformly optimal, the locally optimal, and the fastest searches are identical under not too restrictive assumptions. The mathematical formalism is illustrated by an Earth-approaching asteroid search and optimal searches for such ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: BMC Genomics
سال: 2018
ISSN: 1471-2164
DOI: 10.1186/s12864-018-4621-1